Doob's decomposition theorem for near-submartingales
نویسندگان
چکیده
منابع مشابه
An Obstacle to a Decomposition Theorem for Near-Regular Matroids
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کامل3.4.4 Decomposition Theorem for T
Table 2: Percent a b o ve optimum of Elmore delay to a single critical sink and wire length for three Steiner tree constructions cost comparison is with 1-Steiner. Averages were taken over 200 random nets for each net size. 4.2 Elmore-Optimality of Generic" SERT Algorithm The counterexample in Section 3.3 showing that BB-SORT is not always optimal was carefully constructed by hand; even then, B...
متن کاملDilworth’s Decomposition Theorem for Posets1
The following theorem is due to Dilworth [12]: Let P be a partially ordered set. If the maximal number of elements in an independent subset (anti-chain) of P is k, then P is the union of k chains (cliques). In this article we formalize an elegant proof of the above theorem for finite posets by Perles [17]. The result is then used in proving the case of infinite posets following the original pro...
متن کاملA Decomposition Theorem for Domains
A domain constructor that generalizes the product is de ned. It is shown that with this constructor exactly the prime-algebraic coherent Scott-domains and the empty set can be generated from two-chains and boolean at domains. 3 List of Symbols I am identifying the symbols by the corresponding Latex(+Amssymb)-symbols. " uparrow # downarrow ! rightarrow ? bot > top leq geq 2 in W bigvee V bigwedg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Stochastic Analysis
سال: 2015
ISSN: 0973-9599
DOI: 10.31390/cosa.9.4.03